Hamiltonian Cycle Enumeration via Fermion-Zeon Convolution
نویسندگان
چکیده
منابع مشابه
Dual Power Assignment via Second Hamiltonian Cycle
A power assignment is an assignment of transmission power to each of the wireless nodes of a wireless network, so that the induced graph satisfies some desired properties. The cost of a power assignment is the sum of the assigned powers. In this paper, we consider the dual power assignment problem, in which each wireless node is assigned a highor low-power level, so that the induced graph is st...
متن کاملEnumeration of Hamiltonian Cycles in 6-cube
Finding the number 2H6 of directed Hamiltonian cycles in 6-cube is problem 43 in Section 7.2.1.1 of Knuth’s The Art of Computer Programming ([Kn10]); various proposed estimates are surveyed below. We computed exact value: H6=14, 754, 666, 508, 334, 433, 250, 560=6!*2 4*217, 199*1, 085, 989*5, 429, 923. Also the number Aut6 of those cycles up to automorphisms of 6-cube was computed as 147,365,40...
متن کاملFlexible Gaussian Processes via Convolution
Spatial and spatio-temporal processes are often described with a Gaussian process model. This model can be represented as a convolution of a white noise process and a smoothing kernel. We expand upon this model by considering convolutions of non-iid background processes. We highlight two particular models based on convolutions of Markov random fields and of time-varying processes. These models ...
متن کاملThe parity Hamiltonian cycle problem
This paper investigates a variant of the Hamiltonian Cycle (HC) problem, named the Parity Hamiltonian Cycle (PHC ) problem: The problem is to find a closed walk visiting each vertex odd number of times, instead of exactly once. We show that the PHC problem is in P even when a closed walk is allowed to use an edge at most z = 4 times, by considering a T -join, which is a generalization of matchi...
متن کاملCycle spectra of Hamiltonian graphs
We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least √ 4 7(m − n) different lengths. The coefficient 4/7 cannot be increased above 1, since when m = n2/4 there are √ m − n + 1 cycle lengths in Kn/2,n/2. For general m and n there are examples having at most 2 ⌈
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Theoretical Physics
سال: 2017
ISSN: 0020-7748,1572-9575
DOI: 10.1007/s10773-017-3381-z